Glance on Parallelization of FFT Algorithms
نویسندگان
چکیده
منابع مشابه
FFT Algorithms
The DFT usually arises as an approximation to the continuous Fourier transform when functions are sampled at discrete intervals in space or time. The naive evaluation of the discrete Fourier transform is a matrix-vector multiplication W~g, and would take O(N) operations for N data-points. The general principle of the Fast Fourier Transform algorithms is to use a divide-and-conquer strategy to f...
متن کاملOn Parallelization of Static Scheduling Algorithms
| Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. This paper discusses the essential issues of par-allelization of static scheduling and presents two eecient parallel scheduling algorithms. The proposed algorithms have been implemented on an Intel Paragon machine, and their performance has been evaluated. These algo...
متن کاملParallelization of SAT Algorithms on GPUs
The Boolean Satisfability Problem is one of the most important problems in computer science with applications spannig many areas of research. Despite this importance and the extensive study and improvements that have been made, no efficient solution to the problem has been found to the date. During the last years, nVidia introduced CUDA, a platform which lets developers take advantage of the gr...
متن کاملParallelization of Modular Algorithms
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gröbner bases (resp. standard bases) and the modular computation of the associated primes of a zero–dimensional ideal and describe their parallel implementation in Singular. Our modular algorithms to solve problems over Q mainly consist of three parts, solving the problem ...
متن کاملContemporary View of Fft Algorithms
A large number of fast Fourier transform (FFT) algorithms exist for efficient computation of the discrete Fourier transform (DFT). In most previous benchmarking efforts, only the computation speed or the operations count have been used for assessing the efficiency of these algorithms. In this paper we provide a comprehensive comparison of several contemporary FFT algorithms on state-of-the-art ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Land Forces Academy Review
سال: 2019
ISSN: 2247-840X
DOI: 10.2478/raft-2019-0009